Ant Colony Optimization with Genetic Operations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Algorithm and Ant Colony Optimization

In 1993 some hybrid technics combining OFDM and code division multiple access (CDMA) were proposed [3]. One of that technics is multicarrier code division multiple access (MCCDMA) witch introduce frequency spreading and multiple access. Both, OFDM and MCCDMA, have disadvantage in high peak to average power ratio (PAPR). There are many PAPR reduction schemes are for OFDM and most of them is usef...

متن کامل

Ant Colony Optimization Using Genetic Algorithms

A Genetic algorithms is a search technique used to find true or approximate solutions to optimization and search problems. Hybrid algorithms is proposed to solve combinatorial optimization problem by using "Ant colony and Genetic programming algorithms". The genetic programming paradigm permits the evolution of computer programs which can perform intermediate calculations, which can perform com...

متن کامل

Ant Colony System Optimization

Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...

متن کامل

Ant Colony Optimization

Swarm intelligence is a relatively novel approach to problem solving that takes inspiration from the social behaviors of insects and of other animals. In particular, ants have inspired a number of methods and techniques among which the most studied and the most successful one is the ant colony optimization. Ant colony optimization (ACO) algorithm, a novel population-based and meta-heuristic app...

متن کامل

Evolving Ant Colony Optimization

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automation, Control and Intelligent Systems

سال: 2013

ISSN: 2328-5583

DOI: 10.11648/j.acis.20130103.13